rvgtest - Testing Non-Uniform Random Variate Generator

نویسنده

  • Josef Leydold
چکیده

Non-uniform random variate generators are of fundamental importance in Monte-Carlo methods and stochastic simulation. They are based on the assumption that a source of uniformly distributed random numbers is available that produces real and truely random numbers. In practice, however, we have to use pseudo-random numbers which are generated by means of floating point numbers. Thus there are deviations from the theoretical framework caused by round-off errors which are due to the limitations of floating point arithmetic. In addition algorithm have to developed and implemented. As human can err coding errors or mistakes in the design of algorithm may cause defects in a generated random sample. It is of paramount importance to detect such errors using statistical tools and categorize which tests are sensitive to which errors. rvgtest is a collection of routines for testing non-uniform random variate generators. They hopefully should help to detect all kinds of error. Thus it provides routines for goodness-of-fit tests that are based on histograms and routines to estimate approximation errors for numerical inversion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix-Variate Beta Generator - Developments and Application

Matrix-variate beta distributions are applied in different fields of hypothesis testing, multivariate correlation analysis, zero regression, canonical correlation analysis and etc. A methodology is proposed to generate matrix-variate beta generator distributions by combining the matrix-variate beta kernel with an unknown function of the trace operator. Several statistical characteristics, exten...

متن کامل

Generating sums in constant average time - Simulation Conference Proceedings, 1988 Winter

We derive an algorithm that requires uniformly bounded time to generate the sum of n iid uniform [0,1] random variables. The expected time spent on the computation of the density of the sum per generated random variate tends to zero as n+-. INTRODUCTION. Assume that we wish to generate many independent copies of the random variable S,, = EX,, where the X i ’ s are iid random variables having a ...

متن کامل

Algorithm 488: a Gaussian Pseudo-random Number Generator [g5]

We present an algorithm GRAND for generating normally distributed pseudo-random numbers, assuming the existence of a source of uniform random numbers. The method is exact, apart from the effect of rounding errors. The idea of using a rejection technique to avoid any elementary function evaluations is due to Von Neumann [4] and Forsythe [3], but our implementation requires less uniform samples p...

متن کامل

A Multiplierless Algorithm for Multi-Variate Gaussian Random Number Generation in FPGAs

The multi-variate Gaussian distribution is used to model random processes with distinct pair-wise correlations, such as stock prices that tend to rise and fall together. Multi-variate Gaussian vectors with length n are usually produced by first generating a vector of n independent Gaussian samples, then multiplying with a correlation inducing matrix requiring O(n) multiplications. This paper pr...

متن کامل

A Hardware Architecture for Direct Generation of Multi-Variate Gaussian Random Numbers

The multi-variate Gaussian distribution is used to model random processes with distinct pair-wise correlations, such as stock prices that tend to rise and fall together. Multi-variate Gaussian vectors with length n are usually produced by first generating a vector of n independent Gaussian samples, then multiplying with a correlation inducing matrix requiring O(n) multiplications. This paper pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010